Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
نویسندگان
چکیده
We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previously studied by Hasuo—hence soundness wrt. language inclusion comes for free—but are concretely presented as matrices that are subject to linear inequality constraints. Pervasiveness of these formalisms allows us to exploit existing algorithms in: searching for a simulation, and hence verifying quantitative correctness that is formulated as language inclusion. Transformations of automata that aid search for simulations are introduced, too. This verification workflow is implemented for the plus-times and max-plus semirings.
منابع مشابه
Generic Forward and Backward Simulations
The technique of forward/backward simulations has been applied successfuly in many distributed and concurrent applications. In this paper, however, we claim that the technique can actually have more genericity and mathematical clarity. We do so by identifying forward/backward simulations as lax/oplax morphisms of coalgebras. Starting from this observation, we present a systematic study of this ...
متن کاملCoalgebraic Infinite Traces and Kleisli Simulations
Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli simulation has been developed and it guarantees the soundness of those simulations wrt. finite trace semantics. Moreover, those simulations can be aided by f...
متن کاملReportrapport Forward and Backward Simulations --part Ii: Timing-based Systems Forward and Backward Simulations Part Ii: Timing-based Systems
A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) reenements, (2) forward and backward simulations, (3) forward-backward and backward-forward simulations, and (4) history and prophecy relations. Soundness and completeness results are given for these sim...
متن کاملForward and Backward Simulations, II: Timing-Based Systems
A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinements, (2) forward and backward simulations, (3) hybrid forward backward and backward forward simulations, and (4) history and prophecy relations. Relationships between the different types of simul...
متن کاملEvaluation of backward and forward Lagrangian footprint models in the surface layer
We ran a Lagrangian stochastic (LS) dispersion model in both forward-in-time and backward-in-time ways to derive footprints. Three Eulerian analytical footprint models were compared with this Lagrangian model for a wide atmospheric stability range. Despite some differences among the three analytical footprint models, their results generally agreed. Results from the forward LS simulations agreed...
متن کامل